Constructing efficient simulated annealing algorithms
نویسندگان
چکیده
منابع مشابه
Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms
This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The paper introduces the timetabling problem, and then describes the simulat...
متن کاملParallel Simulated Annealing Algorithms
n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...
متن کاملEfficient Wavelet Sign Prediction: Simulated Annealing vs Genetic Algorithms
Wavelet transforms have proved to be very powerful tools for image compression, since many state-of-the-art image codecs employ DWT into their algorithms. One advantage of this transform is the provision of both frequency and spatial localization of image energy compacted into a small fraction of the transform coefficients, equally likely to be positive or negative. Previous studies have verifi...
متن کاملEfficient Generators in Simulated Annealing
The simulated annealing algorithm is modified to incorporate a generalization of the Metropolis sampling procedure previously applied to homogenous Markov chains by Hastings[8]. In this report, the inhomogenous version of Hastings' procedure is shown to converge asymptotically under conditions similar to Geman and Geman's logarithmic cooling schedule[7]. The new algorithm is experimentally show...
متن کاملAn Efficient Simulated Annealing Schedule
The popularity of simulated annealing comes from its ability to find close to optimal solutions for NPhard combinatorial optimization problems. Unfortunately, the method has a major drawback: its massive requirement of computation time. In this dissertation, we present an efficient annealing schedule which speeds up simulated annealing by a factor of up to twenty-four when compared with general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)80388-5